An Algebraic Method for Compressing Very Large Symbolic Data Tables
نویسنده
چکیده
Although symbolic data tables summarize huge sets of data they can still become very large in size. This paper proposes a method for compressing a symbolic data table using the recently emerged Compound Term Composition Algebra. One charisma of CTCA is that the closed world hypotheses of its operations can lead to a remarkably high ”compression ratio”. The compacted form apart from having much lower storage space requirements, it allows designing more efficient algorithms for symbolic data analysis.
منابع مشابه
An algebraic method for compressing symbolic data tables
Although symbolic data tables summarize huge sets of data they can still become very large in size. This paper proposes a novel technique for compressing a symbolic data table using the recently emerged Compound Term Composition Algebra. One advantage of CTCA is that the closed world hypotheses of its operations can lead to a remarkably high ”compression ratio”. The compacted form apart from ha...
متن کاملNew Method for Large Deflection Analysis of an Elliptic Plate Weakened by an Eccentric Circular Hole
The bending analysis of moderately thick elliptic plates weakened by an eccentric circular hole has been investigated in this article. The nonlinear governing equations have been presented by considering the von-Karman assumptions and the first-order shear deformation theory in cylindrical coordinates system. Semi-analytical polynomial method (SAPM) which had been presented by the author before...
متن کاملMinimal basis for connected Markov chain over 3× 3×K contingency tables with fixed two-dimensional marginals
We consider connected Markov chain for sampling 3 × 3 × K contingency tables having fixed two-dimensional marginal totals. Such sampling arises in performing various tests of the hypothesis of no three-factor interactions. Markov chain algorithm is a valuable tool for evaluating p values, especially for sparse data sets where large-sample theory does not work well. For constructing a connected ...
متن کاملA Proposal for Automated Integral Tables (Work in Progress)
One of the long-term general goals of algebraic manipulation systems has been the automation of difficult or tedious, yet common, symbolic mathematical operations. Prominent among these has been symbolic integration. Although some effective algorithms have been devised for integration especially for those problems solvable in terms of elementary functions and a few additional special functions,...
متن کاملSymbolic Support Graph: A Space Efficient Data Structure for Incremental Tabled Evaluation
In an earlier paper, we described a data structure, called support graph, for efficient incremental evaluation of tabled logic programs. The support graph records the dependencies between answers in the tables, and is crucial for efficiently propagating the changes to the tables when facts are deleted. Incremental computation with support graphs are hundreds of times faster than from-scratch ev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004